/**
 * Software License, Version 1.0
 * 
 * Copyright 2003 The Trustees of Indiana University.  All rights reserved.
 * 
 *
 *Redistribution and use in source and binary forms, with or without 
 *modification, are permitted provided that the following conditions are met:
 *
 *1) All redistributions of source code must retain the above copyright notice,
 * the list of authors in the original source code, this list of conditions and
 * the disclaimer listed in this license;
 *2) All redistributions in binary form must reproduce the above copyright 
 * notice, this list of conditions and the disclaimer listed in this license in
 * the documentation and/or other materials provided with the distribution;
 *3) Any documentation included with all redistributions must include the 
 * following acknowledgement:
 *
 *"This product includes software developed by the Community Grids Lab. For 
 * further information contact the Community Grids Lab at 
 * http://communitygrids.iu.edu/."
 *
 * Alternatively, this acknowledgement may appear in the software itself, and 
 * wherever such third-party acknowledgments normally appear.
 * 
 *4) The name Indiana University or Community Grids Lab or NaradaBrokering, 
 * shall not be used to endorse or promote products derived from this software 
 * without prior written permission from Indiana University.  For written 
 * permission, please contact the Advanced Research and Technology Institute 
 * ("ARTI") at 351 West 10th Street, Indianapolis, Indiana 46202.
 *5) Products derived from this software may not be called NaradaBrokering, 
 * nor may Indiana University or Community Grids Lab or NaradaBrokering appear
 * in their name, without prior written permission of ARTI.
 * 
 *
 * Indiana University provides no reassurances that the source code provided 
 * does not infringe the patent or any other intellectual property rights of 
 * any other entity.  Indiana University disclaims any liability to any 
 * recipient for claims brought by any other entity based on infringement of 
 * intellectual property rights or otherwise.  
 *
 *LICENSEE UNDERSTANDS THAT SOFTWARE IS PROVIDED "AS IS" FOR WHICH NO 
 *WARRANTIES AS TO CAPABILITIES OR ACCURACY ARE MADE. INDIANA UNIVERSITY GIVES
 *NO WARRANTIES AND MAKES NO REPRESENTATION THAT SOFTWARE IS FREE OF 
 *INFRINGEMENT OF THIRD PARTY PATENT, COPYRIGHT, OR OTHER PROPRIETARY RIGHTS. 
 *INDIANA UNIVERSITY MAKES NO WARRANTIES THAT SOFTWARE IS FREE FROM "BUGS", 
 *"VIRUSES", "TROJAN HORSES", "TRAP DOORS", "WORMS", OR OTHER HARMFUL CODE.  
 *LICENSEE ASSUMES THE ENTIRE RISK AS TO THE PERFORMANCE OF SOFTWARE AND/OR 
 *ASSOCIATED MATERIALS, AND TO THE PERFORMANCE AND VALIDITY OF INFORMATION 
 *GENERATED USING SOFTWARE.
 */
package cgl.narada.protocol;
 
/**
 * The link cost matrix maintains the cost associated with traversal over any
 * of the edges within the connectivity graph, hosted at a server node. The
 * link cost matrix reflects the communication costs involved in communication
 * with units at disparate levels. 
 *
 * These costs are not absolute costs, and simply reflect the relative costs
 * associated with communications between nodes in different units as compared
 * to the communication costs between nodes in a cluster. These costs along
 * with the graph traversal rules aid the calculation of the shortest routes
 * from any node in the connectivity graph to the vertex node.
 * 
 * @author Shrideep Pallickara
 * @version $Revision$
 * $Date$
 */

public class LinkCostMatrix implements ProtocolDebugFlags {
  
  private short[] costMatrix;
  private short level;
  
  /** The link cost Matrix constructor. Creation of costs involves 
      specification  of the system Level 
      @param level The system Level.
  */
  public LinkCostMatrix(short level) {
    this.level = level;
    costMatrix = new short[(level+1)*(level+1)];
    initializeCostMatrix();
  }
  
  private void initializeCostMatrix() {
    short width= level;
    width++;
    for (short i=0; i < level+1; i++) {
      for (short j=0; j < level+1; j++) {
	//costMatrix[i*width +j] = (short)(i+j);
	costMatrix[i*width +j] = (short)(i+j+1);
	//System.out.print(costMatrix[i*width + j] + " ");
      }
      //System.out.print("\n");
    }

    for (short i=0; i < ((level+1)*(level+1)); i++) {
      if (LinkCostMatrix_Debug) {
	System.out.print(costMatrix[i]);
      }
    }//System.out.print("\n");
    
  }
  
  /** Returns the cost associated with the traversal over an edge in the
      connectivity graph.
      @param level1 The level of the first node of the edge
      @param level2 The level of the second node of the edge
      @return The cost associated with traversal over the edge. 
  */
  public short computeCost(short level1, short level2) {
    return costMatrix[(level+1)*level1 + level2];
  }
  
  
  public static void main(String[] args) {
    short level = 3;
    LinkCostMatrix linkCost = new LinkCostMatrix(level);
    for (short i=0; i < level+1; i++) {
      for (short j=0; j < level+1; j++) {
	System.out.print(linkCost.computeCost(i,j) + " ");
      }
      System.out.print("\n");
    }
    System.out.println(linkCost.computeCost( (short)0, (short)0 ) );
  }
  
}



